Symbolic–numeric sparse interpolation of multivariate polynomials
نویسندگان
چکیده
منابع مشابه
A new algorithm for sparse interpolation of multivariate polynomials
To reconstruct a black box multivariate sparse polynomial from its floating point evaluations, the existing algorithms need to know upper bounds for both the number of terms in the polynomial and the partial degree in each of the variables. Here we present a new technique, based on Rutishauser’s qd-algorithm, inwhichwe overcome both drawbacks. © 2008 Elsevier B.V. All rights reserved.
متن کاملInterpolation and Approximation of Sparse Multivariate Polynomials over GF(2)
A function f : {0, 1} → {0, 1} is called t-sparse if the n-variable polynomial representation of f over GF (2) contains at most t monomials. Such functions are uniquely determined by their values at the so-called critical set of all binary n-tuples of Hamming weight ≥ n− ⌊log2 t⌋ − 1. An algorithm is presented for interpolating any t-sparse function f , given the values of f at the critical set...
متن کاملRandomized Interpolation and Approximation of Sparse Polynomials
We present a randomized algorithm that interpolates a sparse polynomial in polynomial time in the bit complexity model. The algorithm can be also applied to approximate polynomials that can be approximated by sparse polynomials (the approximation is in the L 2 norm).
متن کاملSparse interpolation of multivariate rational functions
Consider the black box interpolation of a τ -sparse, n-variate rational function f , where τ is the maximum number of terms in either numerator or denominator. When numerator and denominator are at most of degree d, then the number of possible terms in f is O(dn) and explodes exponentially as the number of variables increases. The complexity of our sparse rational interpolation algorithm does n...
متن کاملSparse Interpolation of Black-box Multivariate Polynomials using Kronecker Type Substitutions
In this paper, we give two new deterministic interpolation algorithms for black-box multivariate polynomials. For a t-sparse and n-variate polynomial f with a degree bound D and a term bound T , we show that at least half of the terms of f can be recovered from the univariate polynomials obtained from f by three types of Kronecker substitutions. We then give a criterion to check whether these t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2009
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2008.11.003